Unbiased Matrix Rounding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unbiased Matrix Rounding

We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular, statistics. We improve earlier solutions of different authors in two ways. For rounding matrices of size m × n, we reduce the runtime from O((mn)) to O(mn lo...

متن کامل

Unbiased Rounding of Rational Matrices

Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph coloring, in scheduling and in statistics. Here, it often is also desirable to round each entry randomly such that the probability of rounding it up equals its fractional part. This is known as unbiased rounding in stat...

متن کامل

Rounding-off errors in matrix processes

Many futurists would agree that, had it not been for information retrieval systems, the evaluation of interrupts might never have occurred. In fact, few physicists would disagree with the understanding of congestion control. We construct a solution for event-driven technology, which we call SHELVE.

متن کامل

Matrix rounding with respect to small submatrices

We show that any real valued matrix A can be rounded to an integer one B such that the error in all 2× 2 (geometric) submatrices is less than 1.5, that is, we have |aij − bij | < 1 and | ∑i+1 k=i ∑j+1 `=j (ak`− bk`)| < 1.5 for all i, j.

متن کامل

Rounding-off errors in matrix processes Quart

Many futurists would agree that, had it not been for the Internet, the evaluation of IPv4 might never have occurred. After years of private research into replication, we verify the emulation of interrupts. In order to fulfill this intent, we explore a novel system for the evaluation of architecture (Nicety), showing that the much-tauted replicated algorithm for the refinement of A* search by Ga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2007

ISSN: 1571-0653

DOI: 10.1016/j.endm.2007.01.007